SIAM Journal on Computing -- 1985

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 14, Issue 3, pp. 505-780

Please Note: Electronic articles are available well in advance of the printed articles.

Shift Register Synthesis (Modulo $m$)

J. A. Reeds and N. J. A. Sloane

pp. 505-513

BibTeX Abstract Full Text: PDF

Alphabetic Minimax Trees

David G. Kirkpatrick and Maria M. Klawe

pp. 514-526

BibTeX Abstract Full Text: PDF

Solving Undirected Graph Problems on VLSI

Susanne E. Hambrusch and Janos Simon

pp. 527-544

BibTeX Abstract Full Text: PDF

Biased Search Trees

Samuel W. Bent, Daniel D. Sleator, and Robert E. Tarjan

pp. 545-568

BibTeX Abstract Full Text: PDF

Priority Networks of Communicating Finite State Machines

Mohamed G. Gouda and Louis E. Rosier

pp. 569-584

BibTeX Abstract Full Text: PDF

On Restricting the Size of Oracles Compared with Restricting Access to Oracles

Timothy J. Long

pp. 585-597

BibTeX Abstract Full Text: PDF

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata

R. E. Stearns and H. B. Hunt III

pp. 598-611

BibTeX Abstract Full Text: PDF

An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks

Refael Hassin and Donald B. Johnson

pp. 612-624

BibTeX Abstract Full Text: PDF

An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem

Eugene W. Myers

pp. 625-637

BibTeX Abstract Full Text: PDF

Scheduling Flat Graphs

Danny Dolev and Manfred Warmuth

pp. 638-657

BibTeX Abstract Full Text: PDF

On Comparability and Permutation Graphs

pp. 658-670

BibTeX Abstract Full Text: PDF

The Implication Problem for Functional and Inclusion Dependencies is Undecidable

Ashok K. Chandra and Moshe Y. Vardi

pp. 671-677

BibTeX Abstract Full Text: PDF

A Lower Bound for the Formula Size of Rational Functions

K. A. Kalorkoti

pp. 678-687

BibTeX Abstract Full Text: PDF

On Parallel Searching

pp. 688-708

BibTeX Abstract Full Text: PDF

Approximation of the Consecutive Ones Matrix Augmentation Problem

Marinus Veldhorst

pp. 709-729

BibTeX Abstract Full Text: PDF

Optimal Allocation of Area for Single-Chip Computations

pp. 730-743

BibTeX Abstract Full Text: PDF

Scheduling File Transfers

E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, and A. S. LaPaugh

pp. 744-780

BibTeX Abstract Full Text: PDF